A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
نویسندگان
چکیده
منابع مشابه
A Primal Dual Active Set with Continuation Algorithm for the \ell^0-Regularized Optimization Problem
We develop a primal dual active set with continuation algorithm for solving the l-regularized least-squares problem that frequently arises in compressed sensing. The algorithm couples the the primal dual active set method with a continuation strategy on the regularization parameter. At each inner iteration, it first identifies the active set from both primal and dual variables, and then updates...
متن کاملA Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction
In this paper, efficient algorithms for contact problems with Tresca and Coulomb friction in three dimensions are presented and analyzed. The numerical approximation is based on mortar methods for nonconforming meshes with dual Lagrange multipliers. Using a nonsmooth complementarity function for the 3D friction conditions, a primal-dual active set algorithm is derived. The method determines act...
متن کاملA Primal-dual Active Set Algorithm for Three-dimensional Contact Problems with Coulomb
In this paper, efficient algorithms for contact problems with Tresca and Coulomb friction in three dimensions are presented and analyzed. The numerical approximation is based on mortar methods for nonconforming meshes with dual Lagrange multipliers. Using a nonsmooth complementarity function for the three-dimensional friction conditions, a primal-dual active set algorithm is derived. The method...
متن کاملA Primal-Dual Active-Set Method for Convex Quadratic Programming
The paper deals with a method for solving general convex quadratic programming problems with equality and inequality constraints. The interest in such problems comes from at least two facts. First, quadratic models are widely used in real-life applications. Second, in many algorithms for nonlinear programming, a search direction is determined at each iteration as a solution of a quadratic probl...
متن کاملA Primal Dual Active Set Algorithm for a Class of Nonconvex Sparsity Optimization
In this paper, we consider the problem of recovering a sparse vector from noisy measurement data. Traditionally, it is formulated as a penalized least-squares problem with an `1 penalty. Recent studies show that nonconvex penalties, e.g., `0 and bridge, allow more effective sparse recovery. We develop an algorithm of primal dual active set type for a class of nonconvex sparsity-promoting penalt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2014
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2014.2362880